Constraint Satisfaction with Succinctly Specified Relations
نویسندگان
چکیده
The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations.
منابع مشابه
Signal Processing Structures for Solving Conservative Constraint Satisfaction Problems
This primary purpose of this paper is to succinctly state a number of verifiable and tractable sufficient conditions under which a particular class of conservative signal processing structures may be readily used to solve a companion class of constraint satisfaction problems using both synchronous and asynchronous implementation protocols. In particular, the mentioned class of structures is sho...
متن کاملOn Non-Binary Temporal Relations
I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. Moreover, I investigate how several factors underlying my gene...
متن کاملModel-Based Image Interpretation under Uncertainty and Fuzziness
Structural models such as ontologies and graphs can encode generic knowledge about a scene observed in an image. Their use in spatial reasoning schemes allows driving segmentation and recognition of objects and structures in images. The developed methods include finding a best segmentation path in a graph, global solving of a constraint satisfaction problem, integrating prior knowledge in defor...
متن کاملComputational Complexity of Constraint Satisfaction
The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations over the appropriate domains; the question is if there is an assignment of values to the variables that satisfies all constraints. Different algorithmic tasks for CSPs (checking satisfiability, counting the number of solutions, ...
متن کاملA Generator for Random Non-Binary Finite Constraint Satisfaction Problems
The paper describes an implementation of a generator of random instances of non-binary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in [1]. 1 Description The program is designed to generate random instances of Constraint Satisfaction Problems (CSPs) that meet a set of specified parameters, such as the number of variable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 76 شماره
صفحات -
تاریخ انتشار 2006